The Backdoor Key: A Path to Understanding Problem Hardness
نویسندگان
چکیده
We introduce our work on the backdoor key, a concept that shows promise for characterizing problem hardness in backtracking search algorithms. The general notion of backdoors was recently introduced to explain the source of heavy-tailed behaviors in backtracking algorithms (Williams, Gomes, & Selman 2003a; 2003b). We describe empirical studies that show that the key faction,i.e., the ratio of the key size to the corresponding backdoor size, is a good predictor of problem hardness of ensembles and individual instances within an ensemble for structure domains with large key fraction.
منابع مشابه
Relating Proof Complexity Measures and Practical Hardness of SAT
Boolean satisfiability (SAT) solvers have improved enormously in performance over the last 10–15 years and are today an indispensable tool for solving a wide range of computational problems. However, our understanding of what makes SAT instances hard or easy in practice is still quite limited. A recent line of research in proof complexity has studied theoretical complexity measures such as leng...
متن کاملFrom Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets
Identifying and exploiting hidden problem structures is recognized as a fundamental way to deal with the intractability of combinatorial problems. Recently, a particular structure called (strong) backdoor has been identified in the context of the satisfiability problem. Connections has been established between backdoors and problem hardness leading to a better approximation of the worst case ti...
متن کاملBackdoors in Planning and Scheduling Problems
A backdoor is a set of assignments to a problem that yield the rest of the problem polynomially determinable. Backdoors have been shown to have interesting relationships with problem hardness, backbones and other properties. We show deeper insight into the relationship between backdoors and backbones than has previously been shown. The effect of no-good clause learning on backdoors is also dis-
متن کاملOn the Relationship Between Strong Backdoors and Instance Difficulty in Unsatisfiable Structured CSPs
The concept of backdoor was introduced by the SAT community to explain the computational performance of SAT solvers on large instances. There have been a number of investigations of backdoors for SAT since, but very little on the CSP side. This paper aims to correct this. In order to solve constraint satisfaction problems, a successful branching heuristic in constraint programming must be able ...
متن کاملMatched Formulas and Backdoor Sets
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched formulas). One of the results applies also to a wide range of base classes with added ‘empty clause detection’ as recently considered by Dilkina, Gomes, and Sabharwal. We obtain the hardness results in the framework of p...
متن کامل